Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer

Grasp with Path-relinking for the Multi-plant Capacitated Lot Sizing Problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a pathrelinking intensification procedure ...

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a pathrelinking intensification procedure ...

A Capacitated Lot Sizing Problem with Stochastic Setup Times

In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities

The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to the design...

A Dynamic Multi-Plant Lot-Sizing and Distribution Problem